Coloring Graphs with Constraints on Connectivity
نویسندگان
چکیده
منابع مشابه
Colouring graphs with constraints on connectivity
A graph G has maximal local edge-connectivity k if the maximum number of edge-disjoint paths between every pair of distinct vertices x and y is at most k. We prove Brooks-type theorems for k-connected graphs with maximal local edge-connectivity k, and for any graph with maximal local edge-connectivity 3. We also consider several related graph classes defined by constraints on connectivity. In p...
متن کاملEdge Coloring of Bipartite Graphs with Constraints
It is a classical result from graph theory that the edges of an l{regular bipartite graph can be colored using exactly l colors so that edges that share an endpoint are assigned diierent colors. In this paper we study two constrained versions of the bipartite edge coloring problem. { Some of the edges adjacent to a pair of opposite vertices of an l-regular bipartite graph are already colored wi...
متن کاملPartitioning and coloring graphs with degree constraints
We prove that if G is a vertex-critical graph with χ(G) ≥ ∆(G) + 1 − p ≥ 4 for some p ∈ N and ω(H(G)) ≤ χ(G)+1 p+1 − 2, then G = Kχ(G) or G = O5. Here H(G) is the subgraph of G induced on the vertices of degree at least χ(G). This simplifies the proofs and improves the results in the paper of Kostochka, Rabern and Stiebitz [8].
متن کاملCircular Coloring for Graphs with Distance Constraints
Let G = (V,E) be a simple un-weighted graph, and let → d= (d1, d2, · · ·, dm) be a sequence of positive reals. For a positive real r, let Sr denote the circle on R 2 centered at the origin with circumference r. A circular r−coloring for G with distance constraint → d is a mapping f : V (G) → Sr such that |f(u) − f(v)|r ≥ di, whenever the distance between u and v in G is i (where |x− y|r is the ...
متن کاملSome Results on Edge Coloring Problems with Constraints in Graphs∗
In this paper some new results on the acyclic-edge coloring , f -edge coloring, g-edge cover coloring, (g, f )-coloring and equitable edge-coloring of graphs are introduced. In particular, some new results related to the above colorings obtained by us are given. Some new problems and conjectures are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2016
ISSN: 0364-9024
DOI: 10.1002/jgt.22109